//
// Created by bleedingfight on 2020/6/29.
//
#pragma once
#include <random>
#include <vector>
#include <queue>
#include <map>
std::vector<int>& chooseSort(std::vector<int>& a);
void adjustHeap(std::vector<int> &a, int root);
void buildHeap(std::vector<int> &data);
void heapSort(std::vector<int> &a);
void fastsort(std::vector<int> &nums, int left, int right);
void fastsort1(std::vector<int> &nums, int left, int right);
std::vector<double> bucketsort(std::vector<double> &data);
void countSort(int *a, int *b, int n);
template <typename T> void QuickSort(T array[], int left, int right);
